منابع مشابه
Survival of the Fittest and Zero Sum Games
Competition for available resources is natural amongst coexisting species, and the fittest contenders dominate over the rest in evolution. The dynamics of this selection is studied using a simple linear model. It has similarities to features of quantum computation, in particular conservation laws leading to destructive interference. Compared to an altruistic scenario, competition introduces ins...
متن کاملA TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کاملSurvival of the fittest.
Case in point: The nonsense known as Creationism. I admit that I teach physics, and I do not have much interest in biology or medicine. Nonetheless, I know the difference between biology and bull. I am amazed at how many science students enter our university without the slightest knowledge of what Darwinian evolution is or what it means. It would seem that the American Taliban who wish to repla...
متن کاملThe Testable Implications of Zero-sum Games
We study collective choices from the revealed preference theory viewpoint. For every product set of individual actions, joint choices are called Nash-rationalizable if there exists a preference relation for each player such that the selected joint actions are Nash equilibria of the corresponding game. We characterize Nash-rationalizable joint choice behavior by zero-sum games, or games of confl...
متن کاملSparse binary zero-sum games
Solving zero-sum matrix games is polynomial, because it boils down to linear programming. The approximate solving is sublinear by randomized algorithms on machines with random access memory. Algorithms working separately and independently on columns and rows have been proposed, with the same performance; these versions are compliant with matrix games with stochastic reward. (Flory and Teytaud, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fluctuation and Noise Letters
سال: 2002
ISSN: 0219-4775,1793-6780
DOI: 10.1142/s0219477502000877